Around probabilistic cellular automata
نویسندگان
چکیده
We survey probabilistic cellular automata with approaches coming from combinatorics, statistical physics, and theoretical computer science, each bringing a different viewpoint. Some of the questions studied are specific to a domain, and some others are shared, most notably the ergodicity problem.
منابع مشابه
An Extension of the Inverse Method to Probabilistic Timed Automata
Probabilistic timed automata can be used to model systems in which probabilistic and timing behaviour coexist. Verification of probabilistic timed automata models is generally performed with regard to a single reference valuation π0 of the timing parameters. Given such a parameter valuation, we present a method for obtaining automatically a constraint K0 on timing parameters for which the reach...
متن کاملNonequilibrium physics aspects of probabilistic cellular automata
Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from time-symmetric PCA, satisfying detailed balance, and we give their Kubo formula for linear response. Close-to-detailed balance we investigate the form of the...
متن کاملBroad-band Oscillations by Probabilistic Cellular Automata
Electroencephalographic and magnetoencephalographic potential generated by active brain reveals widespread coherent oscillations. The oscillations of multiple rhythms overlap in broad spectrum noise. Spectrum analysis of short segments reveals peaks in various frequency ranges. As the duration of segments chosen for analysis increases, the basic form to which spectra converge is the one of Brow...
متن کاملComputing with Probabilistic Cellular Automata
We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic cellular automata rule is able to solve the density classification problem, i.e. classifies binary input strings according to the number of 1’s and 0’s in the string, and show that its computational abilities are related to critic...
متن کاملLarge Deviations for Probabilistic Cellular Automata
We consider a generalized model of a probabilistic cellular automata described by a Markov chain on an infinite dimensional space and derive certain large deviations bounds for corresponding occupational measures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 559 شماره
صفحات -
تاریخ انتشار 2014